Which page to page out is the subject of page replacement algorithms.
2.
Dirty bits are used by the CPU cache and in the page replacement algorithms of an operating system.
3.
The supervisor uses one of a variety of page replacement algorithms such as least recently used to determine which page to free.
4.
The method the operating system uses to select the page frame to reuse, which is its page replacement algorithm, is important to efficiency.
5.
This determines the " quality " of the page replacement algorithm : the less time waiting for page-ins, the better the algorithm.
6.
The not frequently used page-replacement algorithm generates fewer page faults than the least recently used page replacement algorithm when the page table contains null pointer values.
7.
The not frequently used ( NFU ) page replacement algorithm requires a counter, and every page has one counter of its own which is initially set to 0.
8.
The " working set model " isn't a page replacement algorithm in the strict sense ( it's actually a kind of medium-term scheduler)
9.
To reduce the page faults in the system, programmers must make use of an appropriate page replacement algorithm that suits the current requirements and maximizes the page hits.
10.
You will find some relevant information in the following articles : page replacement algorithm, backplane ( note spelling ! ), pipeline ( computing ), instruction pipeline.
मोबाइल